On maximal QROBDD's of Boolean functions
نویسندگان
چکیده
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worstcase” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer). Mathematics Subject Classification. 06E30, 68Q15, 94C10, 94C15.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملON MAXIMAL IDEALS OF R∞L
Let $L$ be a completely regular frame and $mathcal{R}L$ be the ring of real-valued continuous functions on $L$. We consider the set $$mathcal{R}_{infty}L = {varphi in mathcal{R} L : uparrow varphi( dfrac{-1}{n}, dfrac{1}{n}) mbox{ is a compact frame for any $n in mathbb{N}$}}.$$ Suppose that $C_{infty} (X)$ is the family of all functions $f in C(X)$ for which the set ${x in X: |f(x)|geq dfrac{1...
متن کاملNo Shannon effect on probability distributions on Boolean functions induced by random expressions∗
The Shannon effect states that “almost all” Boolean functions have a complexity close to the maximal possible for the uniform probability distribution. In this paper we use some probability distributions on functions, induced by random expressions, and prove that this model does not exhibit the Shannon effect.
متن کاملNew Constructions of Resilient Boolean Functions with Maximal Nonlinearity
In this paper we develop a technique that allows to obtain new effective constructions of highly resilient Boolean functions with high nonlinearity. In particular, we prove that the upper bound 2n−1 − 2 on nonlinearity of m-resilient n-variable Boolean functions is achieved for 0.6n− 1 ≤ m ≤ n− 2.
متن کاملOn Resilient Boolean Functions with Maximal Possible Nonlinearity
It is proved that the maximal possible nonlinearity of n-variable m-resilient Boolean
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 39 شماره
صفحات -
تاریخ انتشار 2005